A General Framework for Revising Belief Bases Using Qualitative Jeffrey's Rule
نویسندگان
چکیده
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to uncertain inputs, is used to revise probabilistic epistemic states when new information is uncertain. This paper analyses the expressive power of two possibilistic counterparts of Jeffrey’s rule for modeling belief revision in intelligent agents. We show that this rule can be used to recover most of the existing approaches proposed in knowledge base revision, such as adjustment, natural belief revision, drastic belief revision, revision of an epistemic by another epistemic state. In addition, we also show that that some recent forms of revision, namely reinforcement operators, can also be recovered in our framework.
منابع مشابه
A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to probabilistic inputs, is appropriate for revising probabilistic epistemic states when new information comes in the form of a partition of events with new probabilities and has priority over prior beliefs. This paper analyses the expressive power of tw...
متن کاملOn revising fuzzy belief bases
We look at the problem of revising fuzzy be lief bases, i.e., belief base revision in which both formulas in the base as well as revision input formulas can come attached with vary ing truth-degrees. Working within a very general framework for fuzzy logic which is able to capture certain types of uncertainty calculi as well as truth-functional fuzzy log ics, we show how the idea of rational...
متن کاملOn analysis of unicity of Jeffrey's rule of conditioning in a probabilistic framework
Conditioning is an important task for designing intelligent systems in artificial intelligence. This paper addresses an issue related to the possibilistic counterparts of Jeffrey’s rule of conditioning. More precisely, it addresses the existence and unicity of solutions computed using the possibilistic counterparts of the socalled kinematics properties underlying Jeffrey’s rule of conditioning....
متن کاملRevising General Knowledge Bases in Description Logics
This paper introduces a new methodology of revising general KBs in DL-Lite. Two specific revision operators are defined, their properties are investigated and algorithms for computing revisions are developed.
متن کاملJeffrey's rule of conditioning generalized to belief functions
Jeffrey's rule of conditioning has been proposed in order to revise a probability measure by another probability function. We generalize it within the framework of the models based on belief functions. We show that several forms of Jeffrey's conditionings can be defined that correspond to the geometrical rule of conditioning and to Dempster's rule of conditioning, respectively. 1. Jeffrey's rul...
متن کامل